A Classical Solution to the Paradox of Knowability *

نویسنده

  • Elia Zardini
چکیده

After introducing semantic anti-realism and the paradox of knowability, the paper offers a reconstruction of the anti-realist argument from understanding. The proposed reconstruction validates an unrestricted principle to the effect that truth requires the existence of a certain kind of “demonstration”. The paper shows that that principle fails to imply the problematic instances of the original unrestricted feasible-knowability principle but that the overall view underlying the new principle still has unrestricted epistemic consequences. Appealing precisely to the paradox of knowability, the paper also argues, against the BHK semantics, for the nonconstructive character of the demonstrations envisaged by semantic anti-realism, and contends that, in such setting, one of the most natural arguments for a broadly intuitionist revision of classical logic loses all its force.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Why Knowledge Should Not Be Typed: An Argument against the Type Solution to the Knowability Paradox

The Knowability Paradox is a logical argument to the effect that, if there are truths not actually known, then there are unknowable truths. Recently, Alexander Paseau and Bernard Linsky have independently suggested a possible way to counter this argument by typing knowledge. In this article, we argue against their proposal that if one abstracts from other possible independent considerations sup...

متن کامل

The Church-Fitch knowability paradox in the light of structural proof theory

Anti-realist epistemic conceptions of truth imply what is called the knowability principle: All truths are possibly known. The principle can be formalized in a bimodal propositional logic, with an alethic modality ♦ and an epistemic modality K, by the axiom scheme A ⊃ ♦KA (KP). The use of classical logic and minimal assumptions about the two modalities lead to the paradoxical conclusion that al...

متن کامل

The Knowability Paradox in the light of a Logic for Pragmatics

The Knowability Paradox is a logical argument showing that if all truths are knowable in principle, then all truths are, in fact, known. Many strategies have been suggested in order to avoid the paradoxical conclusion. A family of solutions – called logical revision – has been proposed to solve the paradox, revising the logic underneath, with an intuitionistic revision included. In this paper, ...

متن کامل

Sundholm’s Paradox of Knowability: A Novel Paradox?

In this paper I take a closer look at a recently published paradox by Göran Sundholm involving the notion of knowability. I point out that this paradox is not a novel, genuine paradox, but rather an important variant of the Knower Paradox. I briefly discuss further variations of the Knower Paradox, and in a final section I try to show that it is not unproblematic to assume that knowability is f...

متن کامل

TR-2010008: Knowability from a Logical Point of View

The well-known Church-Fitch paradox shows that the verificationist knowability principle all truths are knowable, yields an unacceptable omniscience property. Our semantic analysis establishes that the knowability principle fails because it misses the stability assumption ‘the proposition in question does not change from true to false in the process of discovery,’ hidden in the verificationist ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015